Multi-Robot Task Allocation Method for Heterogeneous Tasks with Priorities

نویسندگان

  • José Guerrero
  • Gabriel Oliver
چکیده

Task allocation is a complex and open problem for multi-robot systems and very especially if a priority is associated to each task. In this paper, we present a method to allocate tasks with priorities in a team of heterogeneous robots. The system is partially inspired on auction and thresholds-based methods and tries to determine the optimum number of robots that are needed to solve specific tasks taking into account their priorities and characteristics. Thus, we can minimize the interference effect between robots and increase the system performance. The method has been extensively tested for a modification of the well-known foraging task, using different kinds of robots. Experimental results are presented to show the benefits of the proposed method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modified Distributed Bees Algorithm for Multi-Sensor Task Allocation †

Multi-sensor systems can play an important role in monitoring tasks and detecting targets. However, real-time allocation of heterogeneous sensors to dynamic targets/tasks that are unknown a priori in their locations and priorities is a challenge. This paper presents a Modified Distributed Bees Algorithm (MDBA) that is developed to allocate stationary heterogeneous sensors to upcoming unknown ta...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

Winner Determination for Simultaneous Multi-Robot Task Allocation

Multi-robot task allocation is an important problem for heterogeneous mobile robots. Simultaneous allocations with which multiple tasks are being allocated concurrently tend to lead to more efficient allocations than online or single task allocations. However, the simultaneous allocation also increases the complexity in the winner determination process, especially when robots are required to co...

متن کامل

Sensor Network-mediated Multi-robot Task Allocation

We address the Online Multi-Robot Task Allocation (OMRTA) problem. Our approach relies on a computational and sensing fabric of networked sensors embedded into the environment. This sensor network acts as a distributed sensor and computational platform which computes a solution to OMRTA and directs robots to the vicinity of tasks. We term this Distributed In-Network Task Allocation (DINTA). We ...

متن کامل

Sequential Single-Cluster Auctions for Multi-Robot Task Allocation

This thesis studies task allocation in multi-robot teams operating in dynamic environments. The multi-robot task allocation problem is a complex NP-Complete optimisation problem with globally optimal solutions often difficult to find. Because of this, the rapid generation of near optimal solutions to the problem that minimise task execution time and/or energy used by robots is highly desired. O...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004